The CPT Structure of Variable Elimination in Discrete Bayesian Networks
نویسندگان
چکیده
We show that a conditional probability table (CPT) is obtained after every multiplication and every marginalization step when eliminating variables from a discrete Bayesian network. The main advantage of our work is an improvement in presentation. The probability distributions constructed during variable elimination in Bayesian networks have always been denoted as potentials. Since CPTs are a special case of potential, our description is more precise and readable.
منابع مشابه
On Variable Elimination in Discrete Bayesian Network Inference
We are interested in proving that variable elimination (VE) in discrete Bayesian networks always yields a clearly structured conditional probability table (CPT) rather than a potential as universally stated. A Bayesian network consists of a directed acyclic graph and a corresponding set of CPTs. Based on the conditional independencies holding in the directed acyclic graph, the product of the CP...
متن کاملAn Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کامل Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization
A new structure learning approach for Bayesian networks (BNs) based on asexual reproduction optimization (ARO) is proposed in this letter. ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...
متن کاملImproved MDL Score for Learning of Bayesian Networks
In this paper, we propose two modifications to the original Minimum Description Length (MDL) score for learning of Bayesian networks. The first modification is that the description of network structure is proved to be unnecessary and can be omitted in the total MDL score. The second modification consists in reducing the description length of conditional probability table (CPT). In particular, i...
متن کاملOrdering techniques for local elimination algorithms ∗
The use of discrete optimization (DO) models and algorithms makes it possible to solve many reallife problems in scheduling theory, optimization on networks, routing in communication networks, facility location in enterprize resource planing, and logistics. Applications of DO in the artificial intelligence field include theorem proving, SAT in propositional logic, robotics problems, inference c...
متن کامل